An Automated Rule Refinement System

نویسنده

  • J. Shavlik
چکیده

Artificial neural networks (ANNs) are essentially a ‘black box’ technology. The lack of an explanation component prevents the full and complete exploitation of this form of machine learning. This chapter presents an historical perspective on rule extraction from artificial neural networks beginning with 6 ways in which the ANN paradigm may be enriched through the addition of rule extraction / explanation facility. The chapter then describes the general rule extraction task and introduces the Andrews-Diederich-Tickle (ADT) taxonomy for classifying rule extraction techniques. The use of the taxonomy is illustrated by the description of several representative rule extraction algorithms with particular attention being paid to previously described techniques for extracting rules from local function networks. The chapter then describes the concept of rule / theory refinement and includes a discussion of several previously described connectionist approaches to rule / theory refinement. 1.0 Introduction Artificial Neural Networks (ANNs) have qualities that make them attractive to users, viz, i) the ability of the network to ‘learn’ from data through dynamic adaptation of internal numeric weights (as opposed to the tedious ‘knowledge engineering’ phase required to construct a rule based system); ii) the compact (albeit completely numerical) form in which the acquired information/`knowledge' is stored within the trained ANN; iii) the comparative ease and speed with which this `knowledge' can be accessed and used; iv) the robustness of an ANN solution in the presence of `noise' in the input data; and v) the high degree of accuracy reported when an ANN solution is used to generalise over a set of previously unseen examples from the problem domain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prolog, Refinements and RLGG's

Cohen’s [1] refinement rules provide a flexible mechanism for introducing intentional background knowledge in an ILP system. Whereas Cohen used a limited second order theorem prover to implement the rule interpreter, we extend the method to use a full Prolog interpreter. This makes the introduction of more complex background knowledge possible. Although refinement rules have been used to genera...

متن کامل

RULEX & CEBP Networks As the Basis for a Rule Refinement System

In artificial intelligence, knowledge is often represented as a set of rules to be interpreted by an expert system. This rule base is garnered from the knowledge of a domain expert and, for a variety of reasons, may be incomplete, contradictory, or inaccurate. A system using these rules is also static and unable to learn new rules or modify existing rules in the problem domain. In this paper we...

متن کامل

A Framework for Interactive and Automatic Refinement of Transfer-based Machine Translation

Most current Machine Translation (MT) systems do not improve with feedback from post-editors beyond the addition of corrected translations to parallel training data (for statistical and example-base MT) or to a memory database. Rule based systems to date improve only via manual debugging. In contrast, we propose a largely automated method for capturing more information from human post-editors, ...

متن کامل

Using Knowledge Discovery Techniques for Database Schema Refinement

This paper proposes the automated translation of rules extracted from data mining or knowledge discovery tools into active database rules. We term this process of translating a knowledge discovery rule and incorporating it into a database schema in the form of an ECA (eventcondition-action) rule as database schema refinement. We introduce a new rule identification measure for categorising knowl...

متن کامل

The Role of Test Cases in Automated Knowledge Refinement

This paper considers test case selection strategies for the automated knowledge refinement of rule-based expert systems. Refinement systems rely heavily on test cases to find faults in a KB, but also to generate and validate repairs. We argue that test cases should not be regarded as a fixed input to the refinement process, but that they should be actively chosen in order to discriminate betwee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009